AbstractThe “runs” conjecture, proposed by Kolpakov and Kucherov (1999) [7], states that the number of occurrences of maximal repetitions (runs) in a string of length n, runs(n), is at most n. We almost solve the conjecture by proving that runs(n)⩽1.029n. This bound is obtained using a combination of theory and computer verification
AbstractThe notion of run (also called maximal repetition) allows a compact representation of the se...
International audienceThe notion of run (also called maximal repetition) allows a compact representa...
Abstract. We present a new series of run-rich strings, and give a new lower bound 0:94457567 of the ...
AbstractThe “runs” conjecture, proposed by Kolpakov and Kucherov (1999) [7], states that the number ...
International audienceThe cornerstone of any algorithm computing all repetitions in strings of lengt...
AbstractThe cornerstone of any algorithm computing all repetitions in strings of length n in O(n) ti...
AbstractGiven a string x=x[1..n], a repetition of period p in x is a substring ur=x[i+1..i+rp], p=∣u...
Given a string x=x[1..n], a repetition of period pp in x is a substring ur=x[i+1..i+rp], p=∣u∣, r≥2r...
AbstractA run is an inclusion maximal occurrence in a string (as a subinterval) of a repetition v wi...
International audienceSince the work of Kolpakov and Kucherov in 1998, it is known that \rho(n), the...
International audienceThe cornerstone of any algorithm computing all repetitions in a string of leng...
International audienceA run is an inclusion maximal occurrence in a string (as a subinterval) of a r...
The cornerstone of any algorithm computing all repetitions in a string of length $n$ in ${mathca...
AbstractA run in a string is a nonextendable (with the same minimal period) periodic segment in a st...
International audienceA run is an inclusion maximal occurrence in a string (as a subinterval) of a f...
AbstractThe notion of run (also called maximal repetition) allows a compact representation of the se...
International audienceThe notion of run (also called maximal repetition) allows a compact representa...
Abstract. We present a new series of run-rich strings, and give a new lower bound 0:94457567 of the ...
AbstractThe “runs” conjecture, proposed by Kolpakov and Kucherov (1999) [7], states that the number ...
International audienceThe cornerstone of any algorithm computing all repetitions in strings of lengt...
AbstractThe cornerstone of any algorithm computing all repetitions in strings of length n in O(n) ti...
AbstractGiven a string x=x[1..n], a repetition of period p in x is a substring ur=x[i+1..i+rp], p=∣u...
Given a string x=x[1..n], a repetition of period pp in x is a substring ur=x[i+1..i+rp], p=∣u∣, r≥2r...
AbstractA run is an inclusion maximal occurrence in a string (as a subinterval) of a repetition v wi...
International audienceSince the work of Kolpakov and Kucherov in 1998, it is known that \rho(n), the...
International audienceThe cornerstone of any algorithm computing all repetitions in a string of leng...
International audienceA run is an inclusion maximal occurrence in a string (as a subinterval) of a r...
The cornerstone of any algorithm computing all repetitions in a string of length $n$ in ${mathca...
AbstractA run in a string is a nonextendable (with the same minimal period) periodic segment in a st...
International audienceA run is an inclusion maximal occurrence in a string (as a subinterval) of a f...
AbstractThe notion of run (also called maximal repetition) allows a compact representation of the se...
International audienceThe notion of run (also called maximal repetition) allows a compact representa...
Abstract. We present a new series of run-rich strings, and give a new lower bound 0:94457567 of the ...
DOI
Add to ORKG